\begin{abstract}
To address the question above,  traditional keyword-based query or
RDQL won't work well on complicated query for mobile data. For the
best of our knowledge, there is little related work about graph
query for mobile context. The main challenges lie on the lack of
memory and limit of computational ability of mobiles. In this paper,
we propose an efficient graph query by indexing subgraphs for mobile
context(Mquery). We first build indices on mined frequent subgraphs
and then make use of the indices to simplify the topological
structure of the given query. Experiments on one real-world dataset
and a synthetic dataset show that our method outperform the
traditional RDQL by over  50\% in terms of query response time and
query size.
\end{abstract}
